GRASP and path relinking hybridizations for the point matching-based image registration problem
نویسندگان
چکیده
In the last decade, image registration has proven to be a very active research area when tackling computer vision problems, especially in medical applications. In general, image registration methods aim to find a transformation between two images taken under different conditions. Point matching is an image registration approach based on searching for the right pairing of points between the two images, which involves a combinatorial optimization problem. From this matching, the registration transformation can be inferred by means of numerical methods. In this paper, we tackle the medical image registration problem by means of a recent hybrid metaheuristic composed of two well-known optimization methods: GRASP and path relinking. Several designs based on this new hybrid approach have been tested. Our experimentation with real-world problems shows the combination of J. Santamaría ( ) Department of Computer Science, EPS de Linares, University of Jaén, C/ Alfonso X El Sabio, 28, 23700 Linares, Jaén, Spain e-mail: [email protected] O. Cordón · S. Damas European Centre for Soft Computing, Edif. Científico-Tecnológico, C/ Gonzalo Gutiérrez Quirós, 33600 Mieres, Asturias, Spain O. Cordón Department of Computer Science and Artificial Intelligence, E.T.S.I. Informática y Telecomunicación, University of Granada, C. Periodista Daniel Saucedo Aranda, s.n., 18071, Granada, Spain R. Martí Department of Statistics and Operations Research, Facultad de Matemáticas, University of Valencia, C/ Dr. Moliner 50, 46100 Burjassot, Valencia, Spain R.J. Palma Department of Computer Science and Artificial Intelligence, ETSIIT, University of Granada, C/ Daniel Saucedo Aranda, 18071 Granada, Spain 170 J. Santamaría et al. GRASP and evolutionary path relinking performs well when compared to previous state-of-the-art image registration approaches adopting both the point matching and transformation parameter approaches.
منابع مشابه
GRASP and path-relinking: Recent advances and applications
This paper addresses recent advances and application of hybridizations of greedy randomized adaptive search procedures (GRASP) and path-relinking. We present a template for implementing path-relinking as an intensification procedure for GRASP. Enhancements to the procedure, recently described in the literature, are reviewed. The effectiveness of the procedure is illustrated experimentally.
متن کاملMultiobjective GRASP with Path Relinking
In this paper we propose an adaptation of the GRASP metaheuristic to solve multi-objective combinatorial optimization problems. In particular we describe several alternatives to specialize the construction and improvement components of GRASP when two or more objectives are considered. GRASP has been successfully coupled with path-relinking for single-objective optimization. In this paper, we pr...
متن کاملHybridizations of GRASP with Path-Relinking
A greedy randomized adaptive search procedure (GRASP) is a metaheuristic for combinatorial optimization. GRASP heuristics are multistart procedures which apply local search to a set of starting solutions generated with a randomized greedy algorithm or semi-greedy method. The best local optimum found over the iterations is returned as the heuristic solution. Path-relinking is a search intensific...
متن کاملA Metaheuristic Algorithm for the Minimum Routing Cost Spanning Tree Problem
The routing cost of a spanning tree in a weighted and connected graph is defined as the total length of paths between all pairs of vertices. The objective of the minimum routing cost spanning tree problem is to find a spanning tree such that its routing cost is minimum. This is an NP-Hard problem that we present a GRASP with path-relinking metaheuristic algorithm for it. GRASP is a multi-start ...
متن کاملGrasp with Evolutionary Path-relinking
We propose GRASP with evolutionary path-relinking, a metaheuristic resulting from the hybridization of GRASP, path-relinking, and evolutionary path-relinking. This metaheuristic is applied to a network migration problem. Experiments show that a GRASP with evolutionary path-relinking heuristic finds solutions faster than a heuristic based on GRASP with path-relinking as well as one based on pure...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- J. Heuristics
دوره 18 شماره
صفحات -
تاریخ انتشار 2012